منابع مشابه
On L2-Sensitivity Minimization of Linear State-Space Systems
.-tbsfmct-Properties of the soiution to the L.2-sensitivity minimization probiem are discussed. In particular. a specific form of the solution is derived together with a bound. This bound gives an insight into the difference between a pure L.2-sensitivity optimai realization and a mixed L2 / L.’-sensitivity optimal one. The question of L.z-sensitivity baianced truncation is addressed. and a cou...
متن کاملLocal Verification Using a Distributed State Space
This paper deals with the modular analysis of distributed concurrent systems modelled by Petri nets. The main analysis techniques of such systems suffer from the well-known problem of the combinatory explosion of state space. In order to cope with this problem, we use a modular representation of the state space instead of the ordinary one. The modular representation, namely modular state space,...
متن کاملEnumerative Parallel and Distributed State Space Construction
Model Checking requires high end computers to verify complex systems. Consequently, it is interesting to use a multi-processors architectures in order to have more computational resources available to deal with bigger models. This work presents a survey of parallel and distributed state space construction for Model Checking
متن کاملDistributed Graph-Based State Space Generation
LTSMIN provides a framework in which state space generation can be distributed easily over many cores on a single compute node, as well as over multiple compute nodes. The tool works on the basis of a vector representation of the states; the individual cores are assigned the task of computing all successors of states that are sent to them. In this paper we show how this framework can be applied...
متن کاملDistributed State Space Generation of Discrete-State Stochastic Models
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generation and storage of the entire underlying state space. This imposes practical limitations on the types of systems which can be modeled. Because of the vast amount of memory consumed, we investigate distributed algorithms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80812-0